Non-structural subtype entailment in automata theory
نویسندگان
چکیده
منابع مشابه
Non-structural Subtype Entailment in Automata Theory
Decidability of non-structural subtype entailment is a long-standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize the problem equivalently by using regular expressions and word equations. This characterization induces new results on non-structural subtype entailment, constitutes a promising starting point for further investigati...
متن کاملEntailment of Non-structural Subtype Constraints
Entailment of subtype constraints was introduced for constraint simplification in subtype inference systems. Designing an efficient algorithm for subtype entailment turned out to be surprisingly difficult. The situation was clarified by Rehof and Henglein who proved entailment of structural subtype constraints to be coNP-complete for simple types and PSPACE-complete for recursive types. For ent...
متن کاملConstraint Automata and the Complexity of Recursive Subtype Entailment
We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ordered set of possibly infinite labeled trees. The nonstructural ordering on trees is the one introduced by Amadio and Cardelli for subtyping with recursive types. The structural ordering compares only trees with common shape. A ...
متن کاملSubtype satisfiability and entailment
Subtype constraints were introduced in advanced programming language research for designing subtype systems and program analysis algorithms. Two logical problems arise in this context: subtype satisfiability and subtype entailment. Subtype satisfiability underlies subtype inference; subtype entailment is for simplifying subtyping constraints in the same application. In this thesis, we investiga...
متن کاملAlgebra Universalis Structural entailment
We give a number of characterizations of structural entailment. In particular, we show that an alter ego M∼ structurally entails an algebraic relation s on a finite algebra M if and only if s can be obtained via a local construct from M∼ . We show, via a range of applications, that, whereas entailment is important in the study of dualisability, structural entailment is important in the study of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2003
ISSN: 0890-5401
DOI: 10.1016/s0890-5401(03)00140-8